Cohomological Finiteness Conditions in Bredon Cohomology

We show that any soluble group $G$ of type Bredon-\FP_{\infty} with respect to the family of all virtually cyclic subgroups such that centralizers of infinite order elements are of type \FP_{\infty} must be virtually cyclic. To prove this, we first reduce the problem to the case of polycyclic groups and then we show that a polycyclic-by-finite group with finitely many conjugacy classes of maximal virtually cyclic subgroups is virtually cyclic. Finally we discuss refinements of this result: we only impose the property Bredon-\FP_n for some $n \leq 3$ and restrict to abelian-by-nilpotent, abelian-by-polycyclic or (nilpotent of class 2)-by-abelian groups.Comment: Corrected a mistake in Lemma 2.4 of the previous version, which had an effect on the results in Section 5 (the condition that all centralisers of infinite order elements are of type $FP_\infty$ was added

Modelling the exposure to Cronobacter sakazakii by consumption of a cocoa-milk-based beverage processed by pulsed electric fields

peer-reviewedM.C. Pina-Pérez is grateful to CSIC for providing a DOCTOR contract linked to the INNPACTO project IPT-2011-1724-060000. This study was carried out with funds from BISOSTAD project PSE-060000-2009-003, Generalitat Valenciana I+D+I emergent research groups GV/2010/064 and CYCIT project AGL2010-22206-C02-01.Infants’ exposure (Nf ) to Cronobacter sakazakii via the consumption of infant-rich-inpolyphenols cocoa-milk-based beverages (CCX-M) treated with high-intensity pulsed electric fields (PEF) was evaluated. Monte Carlo simulation enabled the prediction of the variability in C. sakazakii load in beverages at the time of consumption to be estimated. Different scenarios (initial contamination levels; PEF treatment conditions; and time-temperature combinations of CCX-M beverages storage after treatment) were simulated. Cocoa addition and PEF treatment resulted in the most influential input factors to control bacterial final load. Cronobacter spp. exposure risk was reduced by a maximum of 100 times at 95% of iterations due to addition of cocoa at 5 g/100 mL, corresponding to scenario 3 (PEF: 15 kV/cm–3,000 μs; storage 120 h at 8 °C). Moreover, the probability of illness for a healthy population was reduced from 2.15 × 10-8, in the baseline scenario, to 4.78 × 10-10 due to cocoa addition and application of 15 kV/cm–3,000 μs PEF treatment.BISOSTAD projec

Subdirect sums of Lie algebras

We show Lie algebra versions of some results on homological finiteness properties of subdirect products of groups. These results include a version of the 1-2-3 Theorem

VLT and GTC observations of SDSS J0123+00: a type 2 quasar triggered in a galaxy encounter?

We present long-slit spectroscopy, continuum and [OIII]5007 imaging data obtained with the Very Large Telescope and the Gran Telescopio Canarias of the type 2 quasar SDSS J0123+00 at z=0.399. The quasar lies in a complex, gas-rich environment. It appears to be physically connected by a tidal bridge to another galaxy at a projected distance of ~100 kpc, which suggests this is an interacting system. Ionized gas is detected to a distance of at least ~133 kpc from the nucleus. The nebula has a total extension of ~180 kpc. This is one of the largest ionized nebulae ever detected associated with an active galaxy. Based on the environmental properties, we propose that the origin of the nebula is tidal debris from a galactic encounter, which could as well be the triggering mechanism of the nuclear activity. SDSS J0123+00 demonstrates that giant, luminous ionized nebulae can exist associated with type 2 quasars of low radio luminosities, contrary to expectations based on type 1 quasar studies.Comment: 6 pages, 5 figures. Accepted for publication in MNRAS Letter

On the conjugacy problem in certain metabelian groups

We analyze the computational complexity of an algorithm to solve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most exponential. For a subfamily of groups, we prove that the conjugacy search problem is polynomial. We also show that for a different subfamily the conjugacy search problem reduces to the discrete logarithm problem